Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
نویسندگان
چکیده
منابع مشابه
Graph Isomorphism is not AC reducible to Group Isomorphism
We give a new upper bound for the Group and Quasigroup Isomorphism problems when the input structures are given explicitly by multiplication tables. We show that these problems can be computed by polynomial size nondeterministic circuits of unbounded fan-in with O(log log n) depth and O(log n) nondeterministic bits, where n is the number of group elements. This improves the existing upper bound...
متن کاملGraph isomorphism is polynomial
We show that the graph isomorphism problem is determined in a polynomial time. This is done by showing that that two graphs on n vertices are isomorphic if and only if a corresponding system of (4n− 1)n equations in n nonnegative variables is solvable. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملGraph Isomorphism is PSPACE-complete
Combining the the results of A.R. Meyer and L.J. Stockmeyer " The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space " , and K.S. Booth " Iso-morphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems " shows that graph isomorphism is PSPACE-complete. The equivalence problem for regular expressions was shown to be PSPACE-...
متن کاملGraph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FPSPP algorithm. This general result has other consequences: for example, it follows that the hidden subgroup problem for permutation groups, studied in the c...
متن کاملSyntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete
We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas φ(a1, . . . , an) and φ(b1, . . . , bn) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that φ(a1, . . . , an) and φ(b1, . . . , bn) become syntactically identical. We first show that the CS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2013
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2540088